Vector Addition System Reversible Reachability Problem
نویسندگان
چکیده
منابع مشابه
Vector Addition System Reversible Reachability Problem
The reachability problem for vector addition systems is a central problem of net theory. This problem is known to be decidable but the complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity are known. In this paper we consider the reversible reachability problem. This problem consists to decide if two configurations are reachable one from each o...
متن کاملVector Addition Systems Reachability Problem (A Simpler Solution)
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known to be decidable by algorithms based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMST decomposition). Recently from this decomposition, we deduced that a final configuration is not reachable from an initial one if and only if there exists a Pres...
متن کاملProjections of Vector Addition System Reachability Sets are Semilinear
The reachability sets of Vector Addition Systems of dimension six or more can be non-semilinear. This may be one reason why the inclusion problem (as well as the equality problem) for reachability sets of vector addition systems in general is undecidable, even though the reachability problem itself is known to be decidable. We show that any one-dimensional projection of the reachability set of ...
متن کاملThe reachability problem for Vector Addition System with one zero-test by Leroux method
We consider here a variation of Vector Addition Systems where one counter can be tested for zero, extending the reachability proof by Leroux for Vector Addition System to our model. This provides an alternate, and hopefully simpler to understand, proof of the reachability problem that was originally proved by Reinhardt.
متن کاملThe Reachability Problem for Vector Addition System with One Zero-Test
We consider here a variation of Vector Addition Systems where one counter can be tested for zero. We extend the reachability proof for Vector Addition System recently published by Leroux to this model. This provides an alternate, more conceptual proof of the reachability problem that was originally proved by Reinhardt.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(1:5)2013